#include "BinaryTree.h"

int main()
{
	char a[] = {'A','B','D',NULL,NULL,'E',NULL,'H',NULL,NULL,'C','F',NULL,NULL,'G',NULL,NULL};
	int i = 0;
	BTNode* root = BinaryTreeCreate(a, &i);
	
	printf("%d\n", BinaryTreeSize(root));
	printf("%d\n", BinaryTreeLeafSize(root));
	printf("%d\n", BTreeHeight(root));
	printf("%d\n", BinaryTreeLevelKSize(root, 2));
	BinaryTreePrevOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");
	BinaryTreePostOrder(root);
	printf("\n");
	BinaryTreeLevelOrder(root);
	printf("\n");

	if (BinaryTreeComplete(root))
		printf("Yes\n");
	else
		printf("No\n");

	BinaryTreeDestory(root);
	return 0;
}